Trail-Directed Model Checking

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trail - Directed Model

HSF-SPIN is a Promela model checker based on heuristic search strategies. It utilizes heuristic estimates in order to direct the search for nding software bugs in concurrent systems. As a consequence, HSF-SPIN is able to nd shorter trails than blind depth-rst search. This paper contributes an extension to the paradigm of directed model checking to shorten already established unacceptable long e...

متن کامل

On Partial-Order Reduction and Trail Improvement in Directed Model Checking

In this paper we address the problem of reconciling trail improvement, partial order reduction and directed explicit state model checking. While directed model checking addresses the problem of finding optimally short counterexamples, trail improvement seeks to find shorter trails to some given error state. Both directed model checking and trail improvement employ heuristic, guided search techn...

متن کامل

Abstraction in Directed Model Checking

ion in Directed Model Checking Stefan Edelkamp Fachbereich Informatik Universität Dortmund [email protected] Alberto Lluch-Lafuente Dipartimento di Informatica Università di Pisa [email protected]

متن کامل

Context-Enhanced Directed Model Checking

Directed model checking is a well-established technique to efficiently tackle the state explosion problem when the aim is to find error states in concurrent systems. Although directed model checking has proved to be very successful in the past, additional search techniques provide much potential to efficiently handle larger and larger systems. In this work, we propose a novel technique for trav...

متن کامل

Transition-Based Directed Model Checking

Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by influencing the order in which states are explored during the state space traversal. The order is typically determined by an abstract distance function that estimates a state’s distance to a nearest error state. In this paper, we p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2001

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(04)00261-0